A Sokoban-type game and arc deletion within irregular digraphs of all sizes

نویسندگان

Zyta Dziechcinska-Halamoda

Zofia Majcher

Jerzy Michael

Zdzislaw Skupien

چکیده

Digraphs in which ordered pairs of outand in-degrees of vertices are mutually distinct are called irregular, see Gargano et al. [3]. Our investigations focus on the problem: what are possible sizes of irregular digraphs (oriented graphs) for a given order n? We show that those sizes in both cases make up integer intervals. The extremal sizes (the 612 Z. Dziechcińska-Halamoda, Z. Majcher, ... endpoints of these intervals) are found in [1, 5]. In this paper we construct, with help of Sokoban-type game, n-vertex irregular oriented graphs (irregular digraphs) of all intermediate sizes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using an Algorithm Portfolio to Solve Sokoban

The game of Sokoban is an interesting platform for algorithm research. It is hard for humans and computers alike. Even with its simple rules and small average level sizes there are levels that take a lot of computation for all known algorithms. In this thesis we will combine different Sokoban solvers with different domain specific enhancements into one portfolio. This portfolio can then be run ...

متن کامل

Generating Sokoban Puzzle Game Levels with Monte Carlo Tree Search

In this work, we develop a Monte Carlo Tree Search based approach to procedurally generate Sokoban puzzles. To this end, we propose heuristic metrics based on surrounding box path congestion and level tile layout to guide the search towards interesting puzzles. Our method generates puzzles through simulated game play, guaranteeing solvability in all generated puzzles. Our algorithm is efficient...

متن کامل

Irregularity strength of digraphs

It is an elementary exercise to show that any non-trivial simple graph has two vertices with the same degree. This is not the case for digraphs and multigraphs. We consider generating irregular digraphs from arbitrary digraphs by adding multiple arcs. To this end, we define an irregular labeling of a digraph D to be an arc labeling of the digraph such that the ordered pairs of the sums of the i...

متن کامل

Economic Analysis of Late Payment Fines Remission of Driving in Iran, Game Theory Approach

One of the most important tools to reduce traffic violations and consequently the number of accidents in the country is to penalize the offenders. In Iran, double penalty is approved for delaying in payment of a fine, but it is possible that a significant number of offenders would not pay their fines in addition to late payment fines. Hence, in this study, the interactions between traffic polic...

متن کامل